Detection of constrictions on closed polyhedral surfaces
نویسندگان
چکیده
We define constrictions on a surface as simple closed geodesic curves, i.e. curves whose length is locally minimal. They can be of great interests in order to cut the surface in smaller parts. In this paper, we present a method to detect constrictions on closed triangulated surfaces. Our algorithm is based on a progressive approach. First, the surface is simplified by repeated edge collapses. The simplification continues until we detect an edge whose collapse would change the topology of the surface. It happens when three edges of the surface form a triangle that does not belong to the surface. The three edges define what we call a seed curve and are used to initialize the search of a constriction. Secondly, the constriction is progressively constructed by incrementally refining the simplified surface until the initial surface is retrieved. At each step of this refinement process, the constriction is updated. Some experimental results are provided.
منابع مشابه
From a Closed Piecewise Geodesic to a Constriction on a Closed Triangulated Surface
Constrictions on a surface are defined as simple closed curves whose length is locally minimal. In particular, constrictions are periodic geodesics. We use constrictions in order to segment objects. In [4], we proposed an approach based on progressive surface simplification and local geodesic computation. The drawback of this approach is that constrictions are approximated by closed piecewise g...
متن کاملConstriction Computation using Surface Curvature
This paper provides a curvature-based algorithm to compute locally shortest geodesics on closed triangulated surfaces. These curves, which are called “constrictions”, are useful for shape segmentation. The key idea of the algorithm is that constrictions are almost plane curves; it first finds well-located simple, plane, closed curves, and then slides them along the surface until a shortest geod...
متن کاملNonrealizable Minimal Vertex Triangulations of Surfaces: Showing Nonrealizability Using Oriented Matroids and Satisfiability Solvers
We show that no minimal vertex triangulation of a closed, connected, orientable 2-manifold of genus 6 admits a polyhedral embedding in R. We also provide examples of minimal vertex triangulations of closed, connected, orientable 2-manifolds of genus 5 that do not admit any polyhedral embeddings. We construct a new infinite family of non-realizable triangulations of surfaces. These results were ...
متن کاملConvergence of the Natural hp-BEM for the Electric Field Integral Equation on Polyhedral Surfaces
We consider the variational formulation of the electric field integral equation (EFIE) on bounded polyhedral open or closed surfaces. We employ a conforming Galerkin discretization based on divΓ-conforming Raviart-Thomas boundary elements (BEM) of locally variable polynomial degree on shape-regular surface meshes. We establish asymptotic quasi-optimality of Galerkin solutions on sufficiently fi...
متن کامل2 00 6 Rigidity of Polyhedral Surfaces
We study rigidity of polyhedral surfaces and the moduli space of polyhedral surfaces using variational principles. Curvature like quantities for polyhedral surfaces are introduced. Many of them are shown to determine the polyhedral metric up to isometry. The action functionals in the variational approaches are derived from the cosine law and the Lengendre transformation of them. These include e...
متن کامل